Service robot planning via solving constraint satisfaction problem

Cooperative problem solving against adversary: quantified distributed constraint satisfaction problem

In this paper, we extend the traditional formalization of distributed constraint satisfaction problems (DisCSP) to a quantified DisCSP. A quantified DisCSP includes several universally quantified variables, while all of the variables in a traditional DisCSP are existentially quantified. A universally quantified variable represents a choice of nature or an adversary. A quantified DisCSP formaliz...

Solving constraint satisfaction

Many constraint satisfaction problems involve sequencing constraints, where the aim is to nd a sequence for a domain of values such that all the constraints on the sequence are satissed. Specialised techniques have been developed to tackle this problem within the constraint programming framework using constructive, backtracking search. In this paper we investigate local search techniques to tac...

Solving a Constraint Satisfaction Problem through Iterative Reordering Augmentation

Solving a Time Tabling Problem by Constraint Satisfaction

The time tabling problem is well known and much research has been done about it. This paper shows how a difficult instance of the time tabling problem with many parameters and loose constraints can be handled using constraint satisfaction. To this end the constraints have to be modeled in a format that can be handled efficiently. It is shown how several modelling problems can be solved in a gen...

Solving an Air Conditioning System Problem using Constraint Satisfaction

In this paper, the embodiment design of an air conditioning system (ACS) in an aircraft is investigated using interval constraint satisfaction techniques. The detailed ACS model is quite complex to solve, since it contains many coupled variables and many constraints corresponding to complex physics phenomena. Some new heuristics and notions based on embodiment design knowledge, are brie y intro...